翻訳と辞書 Words near each other ・ 100 North Main ・ 100 North Main Street ・ 100 North Tampa ・ 100 Oaks Mall ・ 100 Orders ・ 100 Park Avenue Building ・ 100 Peaks of Taiwan ・ 100 People Who Are Screwing Up America ・ 100 petametres ・ 100 Photographs that Changed the World ・ 100 picometres ・ 100 Pine Center ・ 100 Pipers ・ 100 point check ・ 100 points ・ 100 prisoners problem ・ 100 Proof ・ 100 Proof (Aged in Soul) ・ 100 Proof (album) ・ 100 Proof (film) ・ 100 Proof (song) ・ 100 Questions ・ 100 Racks ・ 100 Rifles ・ 100 Rogues ・ 100 series ・ 100 Series Shinkansen ・ 100 Soundscapes of Japan ・ 100 Squadron ・ 100 Squadron (Israel) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク 100 prisoners problem ： ウィキペディア英語版 100 prisoners problem The 100 prisoners problem is a mathematical problem from probability theory and combinatorics. In this problem, in order to survive, 100 prisoners have to find their own numbers in one of 100 drawers. The rules of the problem state that each prisoner may open only 50 of the drawers and cannot communicate with the other prisoners. At first glance the situation appears hopeless, but a clever strategy exists which offers the prisoners a realistic chance of survival. The problem was first posed in 2003 by Danish computer scientist Peter Bro Miltersen. == Problem == The 100 prisoners problem has different renditions in the literature. The following version is by Philippe Flajolet and Robert Sedgewick: :''The director of a prison offers 100 prisoners on death row, which are numbered from 1 to 100, a last chance. In a room there is a cupboard with 100 drawers. The director puts in each drawer the number of exactly one prisoner in random order and closes the drawers afterwards. The prisoners enter the room one after another. Each prisoner may open and look into 50 drawers in any order and the drawers are closed again afterwards. If during this search every prisoner finds his number in one of the drawers, all prisoners are pardoned. If just one prisoner does not find his number, all prisoners have to die. Before the first prisoner enters the room, the prisoners may discuss their strategy, afterwards no communication of any means is possible. What is the best strategy for the prisoners?'' If every prisoner selects 50 drawers at random, the probability that a single prisoner finds his number is 50%. Therefore, the probability that all prisoners find their numbers is the product of the single probabilities which is (½)100 ≈ 0.0000000000000000000000000000008, a vanishingly small number. The situation appears hopeless for the prisoners. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「100 prisoners problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.